A note upon minimal path problem
نویسندگان
چکیده
منابع مشابه
The Stochastic Quickest Path Problem via Minimal Paths
The quickest path problem, a version of the shortest path problem, is to find a single quickest path which sends a given amount of data from the source to the sink with minimum transmission time. More specifically, the capacity of each arc in the network is assumed to be deterministic. However, in many real-life networks such as computer systems, telecommunication systems, etc., the capacity of...
متن کاملNumber of Minimal Path Sets in a Consecutive-k-out-of-n: F System
In this paper the combinatorial problem of determining the number of minimal path sets of a consecutive-k-out-of-n: F system is considered. For the cases where k = 2, 3 the explicit formulae are given and for k ≥ 4 a recursive relation is obtained. Direct computation for determining the number of minimal path sets of a consecutive-k-out-of-n: F system for k ≥ 4 remains a difficult task. ...
متن کاملA hybrid algorithm for the path center problem
Let a graph G = (V;E) be given. In the path center problem we want to find a path P in G such that the maximum weighted distance of P to every vertex in V is minimized. In this paper a genetic algorithm and ahybrid of genetic and ant colony algorithms are presented for the path center problem. Some test problems are examined to compare the algorithms. The results show that for almost all exampl...
متن کاملA Note on Minimal Modular Symbols
For any arithmetic group, a set of geometrically-defined cohomology classes is constructed which spans the cohomology of the group with rational coefficients in the highest nonvanishing dimension thereof. This note gives a geometrical spanning set S for the cohomology of an arithmetic group in the highest nonvanishing dimension. To do this, I generalize the first three sections of [1]. Unfortun...
متن کاملA note on minimal matching covered graphs
A graph is called matching covered if for its every edge there is a maximum matching containing it. It is shown that minimal matching covered graphs contain a perfect matching.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1970
ISSN: 0022-247X
DOI: 10.1016/0022-247x(70)90154-x